Construction of minimal non-abelian left group codes
نویسندگان
چکیده
منابع مشابه
Construction of minimal non-abelian left group codes
Algorithms to construct minimal left group codes are provided. These are based on results describing a complete set of orthogonal primitive idempotents in each Wedderburn component of a semisimple finite group algebra FG for a large class of groups G. As an illustration of our methods, alternative constructions to some best linear codes over F2 and F3 are given. Furthermore, we give constructio...
متن کاملIdempotents in group algebras and minimal abelian codes
We compute the number of simple components of a semisimple finite abelian group algebra and determine all cases where this number is minimal; i.e. equal to the number of simple components of the rational group algebra of the same group. This result is used to compute idempotent generators of minimal abelian codes, extending results of Arora and Pruthi [S.K. Arora, M. Pruthi, Minimal cyclic code...
متن کاملG-equivalence in group algebras and minimal abelian codes
Let G be a finite abelian group and F a field such that char(F) 6 | |G|. Denote by FG the group algebra of G over F. A (semisimple) abelian code is an ideal of FG. Two codes I1 and I2 of FG are G-equivalent if there exists an automorphism ψ of G whose linear extension to FG maps I1 onto I2. In this paper we give a necessary and sufficient condition for minimal abelian codes to be G-equivalent a...
متن کاملMinimal Binary Abelian Codes of length pq
We consider binary abelian codes of length pq where p and q are prime rational integers under some restrictive hypotheses. In this case, we determine the idempotents generating minimal codes and either the respective weights or bounds of these weights. We give examples showing that these bounds are attained in some cases.
متن کاملConstruction of Minimal Tail-Biting Trellises for Codes over Finite Abelian Groups
A definition of atomic codeword for a group code is presented. Some properties of atomic codewords of group codes are investigated. Using these properties, it is shown that every minimal tail-biting trellis for a group code over a finite abelian group can be constructed from its characteristic generators, which extends the work of Koetter and Vardy who treated the case of a linear code over a f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs, Codes and Cryptography
سال: 2014
ISSN: 0925-1022,1573-7586
DOI: 10.1007/s10623-014-9922-z